Programming Research Group CONVERTING SORTING ALGORITHMS TO FAST RANDOMIZED ONES VIA SEARCHING
نویسندگان
چکیده
In this work we present an algorithmic transformation, that given two algorithms implementing respectively, sorting and searching, provides a randomized sorting algorithm that with high probability requires less time than the original sorting algorithm. This claim is true for a wide range of the parameters that describe the running time of the procedures for sorting and searching.
منابع مشابه
Programming Research Group COMMUNICATION EFFICIENT DATA STRUCTURES ON THE BSP MODEL WITH APPLICATIONS
The implementation of data structures on distributed memory models such as the Bulk-Synchronous Parallel (BSP) model, rather than shared memory ones such as the PRAM, ooers a serious challenge. In this work we undertake the architecture independent study of the communication and synchronization requirements of searching ordered h-level graphs, which include most of the standard data structures....
متن کاملProgramming Research Group AN EXPERIMENTAL STUDY OF SORTING ALGORITHMS ON THE BSP MODEL: THEORY, PRACTICE AND EXPERIENCE
The Bulk-Synchronous Parallel (BSP) model of computation has been proposed by L.G. Valiant as a unifying and bridging model for the design, analysis and implementation of parallel algorithms that are both scalable and portable among diverse parallel machines. In this work we implement, using the Oxford BSP Toolset, BSPlib, a multiplicity of BSP deterministic and randomized sorting algorithms on...
متن کاملA Fast Natural Algorithm for Searching: Preliminary version
In this note we present two natural algorithms—one for sorting and another for searching a sorted list of items. Both algorithms work in O( √ N) time, N being the size of the list. A combination of these algorithms can search an unsorted list in O( √ N) time, an impossibility for classical algorithms. The same complexity is achieved by Grover’s quantum search algorithm; in contrast to Grover’s ...
متن کاملStriving for Efficiency in Algorithms: Sorting
Sorting is the fundamental algorithmic problem in computer science. It is the first step in solving many other algorithmic problems. Donald Knuth, a world famous computer scientist and author of the book “The Art of Computer Programming, Volume 3: Sorting and Searching”, wrote: “I believe that virtually every important aspect of programming arises somewhere in the context of searching or sorting”.
متن کاملSorting, Searching, and Simulation in the MapReduce Framework
In this paper, we study the MapReduce framework from an algorithmic standpoint and demonstrate the usefulness of our approach by designing and analyzing efficient MapReduce algorithms for fundamental sorting, searching, and simulation problems. This study is motivated by a goal of ultimately putting the MapReduce framework on an equal theoretical footing with the well-known PRAM and BSP paralle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997